//#pragma comment(linker,"/STACK:16777216") /*16Mb*/
//#pragma comment(linker,"/STACK:33554432") /*32Mb*/
#define _CRT_SECURE_NO_DEPRECATE
#include<iostream>
#include<numeric>
#include<sstream>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<memory>
#include<string>
#include<vector>
#include<cctype>
#include<list>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<algorithm>
using namespace std;

typedef unsigned long long      ui64;
typedef long long               i64;
typedef	vector<int>             VI;
typedef	vector<bool>            VB;
typedef	vector<VI>              VVI;
typedef	vector<string>          VS;
typedef	pair<int,int>           PII;
typedef map<string,int>         MSI;
typedef set<int>                SI;
typedef set<string>             SS;
typedef map<int,int>            MII;
typedef	pair<double,double>     PDD;

#define PB                      push_back
#define MP                      make_pair
#define X                       first
#define Y                       second
#define FOR(i, a, b)            for(int i = (a); i < (b); ++i)
#define RFOR(i, a, b)           for(int i = (a) - 1; i >= (b); --i)
#define CLEAR(a, b)             memset(a, b, sizeof(a))
#define SZ(a)                   int((a).size())
#define ALL(a)                  (a).begin(), (a).end()
#define RALL(a)                 (a).rbegin(), (a).rend()
#define INF                     (2000000000)


int main()
{
	int n;
	cin >> n;
	map<string, int> M;
	VI v(n);
	M["unknown"] = 0;
	FOR(i,0,n) {
		string s; cin >> s;
		if( M.find(s)!=M.end() )
			v[i] = M[s];
		else
			v[i] = M[s] = SZ(M);
	}
	VI ans;
	
	FOR(i,1,n+1) {
		set<int> S;
		if( n%i==0 ) {
			bool bx = true;
			int tmp = 0;
			FOR(j,0,n) {
				if( v[j]!=0 ) {
					if( tmp==0 ) {
						tmp = v[j];
						if( S.find(tmp)!=S.end() )
							bx = false;
						S.insert(tmp);
					}
					else
						if( tmp!=v[j] )
							bx = false;
				}
				if((j+1)%i==0) tmp = 0;
			}
			if( bx ) {
				ans.PB(n/i);
			}
		}
	}
	sort(ALL(ans));
	if( !SZ(ans) )
		cout << "Igor is wrong.\n";
	FOR(i,0,SZ(ans))
		printf("%d%c",ans[i], i==SZ(ans)-1?'\n':' ');
    return 0;
}